A Stochastic Programming Approach to Resource-Constrained Assignment Problems
نویسندگان
چکیده
We address the resource-constrained generalizations of the assignment problem with uncertain resource capacities, where the resource capacities have an unknown distribution that can be sampled. We propose three stochastic programming-based formulations that can be used to solve this problem, and provide exact and approximate solution techniques for the resulting models. We also present numerical results for a large set of numerical problems. The results indicate that the solutions obtained using the stochastic programming approaches perform significantly better than those obtained using expected values of capacities in a deterministic solution strategy. In addition, stochastic-programming-based approximations are computationally as efficient as deterministic techniques.
منابع مشابه
The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملSplittable stochastic project scheduling with constrained renewable resource
This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کامل